A QP-free constrained Newton-type method for variational inequality problems
نویسندگان
چکیده
We consider a simply constrained optimization reformulation of the KarushKuhn-Tucker conditions arising from variational inequalities. Based on this reformulation, we present a new Newton-type method for the solution of variational inequalities. The main properties of this method are: (a) it is well-defined for an arbitrary variational inequality problem, (b) it is globally convergent at least to a stationary point of the constrained reformulation, (c) it is locally superlinearly/quadratically convergent under a certain regularity condition, (d) all iterates remain feasible with respect to the constrained optimization reformulation, and (e) it has to solve just one linear system of equations at each iteration. Some preliminary numerical results indicate that this method is quite promising.
منابع مشابه
A Hybrid Newton Method for Solving Box Constrained Variational Inequality Problems via the D-gap Function
A box constrained variational inequality problem can be reformulated as an unconstrained minimization problem through the D-gap function. A hybrid Newton-type method is proposed for minimizing the D-gap function. Under suitable conditions, the algorithm is shown to be globally convergent and locally quadratically convergent. Some numerical results are also presented.
متن کاملA Hybrid Josephy-newton Method for Solving Box Constrained Variational Inequality Problems via the D-gap Function
A box constrained variational inequality problem can be reformulated as an unconstrained minimization problem through the D-gap function. Some basic properties of the aane variational inequality subproblems in the classical Josephy-Newton method are studied. A hybrid Josephy-Newton method is then proposed for minimizing the D-gap function. Under suitable conditions, the algorithm is shown to be...
متن کاملMonotone Iterations for Elliptic Variational Inequalities
A wide range of free boundary problems occurring in engineering and industry can be rewritten as a minimization problem for a strictly convex, piecewise smooth but non–differentiable energy functional. The fast solution of related discretized problems is a very delicate question, because usual Newton techniques cannot be applied. We propose a new approach based on convex minimization and constr...
متن کاملIterations for Elliptic Variational Inequalities
A wide range of free boundary problems occurring in engineering and industry can be rewritten as a minimization problem for a strictly convex, piecewise smooth but non{diierentiable energy functional. The fast solution of related discretized problems is a very delicate question, because usual Newton techniques cannot be applied. We propose a new approach based on convex minimization and constra...
متن کاملA Gauss-Newton Approach for Solving Constrained Optimization Problems Using Differentiable Exact Penalties
We propose a Gauss-Newton-type method for nonlinear constrained optimization using the exact penalty introduced recently by André and Silva for variational inequalities. We extend their penalty function to both equality and inequality constraints using a weak regularity assumption, and as a result, we obtain a continuously differentiable exact penalty function and a new reformulation of the KKT...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 85 شماره
صفحات -
تاریخ انتشار 1999